Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Enumeration")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 9258

  • Page / 371
Export

Selection :

  • and

On restricted forms of enumeration reducibilityWATSON, P.Annals of pure and applied logic. 1990, Vol 49, Num 1, pp 75-96, issn 0168-0072, 22 p.Article

On minimal pairs of enumeration degreesMCEVOY, K; COOPER, S. B.The Journal of symbolic logic. 1985, Vol 50, Num 4, pp 983-1001, issn 0022-4812Article

Proceedings/Colloque de combinatoire énumérative UQAM, Montréal PQ, May 28-June 1, 1985LABELLE, G; LEROUX, P.Lecture notes in mathematics. 1986, Vol 1234, issn 0075-8434, XIV-387Conference Proceedings

NUMERATIONS UNIVOQUES CALCULABLESGONCHAROV SS.1980; ALGEBRA LOG.; ISSN 0373-9252; SUN; DA. 1980; VOL. 19; NO 5; PP. 507-551; BIBL. 10 REF.Article

On the Cantor-Bendixon rank of recursively enumerable setsCHOLAK, P; DOWNEY, R.The Journal of symbolic logic. 1993, Vol 58, Num 2, pp 629-640, issn 0022-4812Conference Paper

Enumeration by frame group and range groupsREDFIELD, J. H.Journal of graph theory. 1984, Vol 8, Num 2, pp 205-223, issn 0364-9024Article

Enumeration degrees of the bounded total setsSOLON, Boris; ROZHKOV, Sergey.Lecture notes in computer science. 2006, pp 737-745, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 9 p.Conference Paper

Weak density andcupping in the D-R.E. degreesBARRY COOPER, S; LEMPP, S; WATSON, P et al.Israel Journal of Mathematics. 1989, Vol 67, Num 2, pp 137-152, issn 0021-2172, 16 p.Article

Positive definite matrices and Catalan numbers, revisitedSHAPIRO, L. W.Proceedings of the American Mathematical Society. 1984, Vol 90, Num 3, pp 488-496, issn 0002-9939Article

Selecting k objects from a cycle with p pairs of separation sHWANG, F. K.Journal of combinatorial theory. Series A. 1984, Vol 37, Num 2, pp 197-199, issn 0097-3165Article

Challenges in the Enumeration and Phenotyping of CTCCOUMANS, Frank A. W; LIGTHART, Sjoerd T; UHR, Jonathan W et al.Clinical cancer research (Print). 2012, Vol 18, Num 20, pp 5711-5718, issn 1078-0432, 8 p.Article

Assessment of factors influencing direct enumeration of viruses within estuarine sedimentsHELTON, Rebekah R; LING LIU; ERIC WOMMACK, K et al.Applied and environmental microbiology (Print). 2006, Vol 72, Num 7, pp 4767-4774, issn 0099-2240, 8 p.Article

The enumeration of shift register sequencesBRYANT, P. R; CHRISTENSEN, J.Journal of combinatorial theory. Series A. 1983, Vol 35, Num 2, pp 154-172, issn 0097-3165Article

Rigid clusters enumerationPRUNET, V; BLANC, R.Journal of physics. A, mathematical and general. 1986, Vol 19, Num 18, pp L1197-L1199, issn 0305-4470Article

Molecular Enumeration of an Ecologically Important Cyanophage in a Laurentian Great LakeMATTESON, Audrey R; LOAR, Star N; BOURBONNIERE, Richard A et al.Applied and environmental microbiology (Print). 2011, Vol 77, Num 19, pp 6772-6779, issn 0099-2240, 8 p.Article

Particle occupation factors without large number approximationRAJAGOPAL, A. K; TEITLER, S.Physica. A. 1988, Vol 147, Num 3, pp 627-635, issn 0378-4371Article

THE UNIFICATION OF CERTAIN ENUMERATION PROBLEMS FOR SEQUENCES.JACKSON DM.1977; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1977; VOL. 22; NO 1; PP. 92-96; BIBL. 10 REF.Article

Toward optimal motif enumerationEVANSL, Patricia A; SMITH, Andrew D.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

A homomorphic characterization of recursively enumerable languagesHIROSE, S; OKAWA, S; YONEDA, M et al.Theoretical computer science. 1985, Vol 35, Num 2-3, pp 261-269, issn 0304-3975Article

Enumeration of self-dual configurationsPALMER, E. M; ROBINSON, R. W.Pacific journal of mathematics. 1984, Vol 110, Num 1, pp 203-221, issn 0030-8730Article

Computational aspects of Σ-definability over the real numbers without the equality testKOROVINA, Margarita.Lecture notes in computer science. 2003, pp 330-344, issn 0302-9743, isbn 3-540-40801-0, 15 p.Conference Paper

A method for cutting squares into distinct squaresGAMBINI, I.Discrete applied mathematics. 1999, Vol 98, Num 1-2, pp 65-80, issn 0166-218XArticle

Invertible classesJAIN, Sanjay; NESSEL, Jochen; STEPHAN, Frank et al.Lecture notes in computer science. 2006, pp 707-720, issn 0302-9743, isbn 3-540-34021-1, 1Vol, 14 p.Conference Paper

Enumerating pairs of permutations with the same up-down formMALLOWS, C. L; SHEPP, L. A.Discrete mathematics. 1985, Vol 54, Num 3, pp 301-311, issn 0012-365XArticle

On strong starters in cyclic groupsKOCAY, W. L; STINSON, D. R; VANSTONE, S. A et al.Discrete mathematics. 1985, Vol 56, Num 1, pp 45-60, issn 0012-365XArticle

  • Page / 371